A General Minimal Residual Krylov Subspace Method for Large-Scale Model Reduction - Automatic Control, IEEE Transactions on

نویسندگان

  • V. Borkar
  • E. Fernández-Gaucherand
  • M. K. Ghosh
چکیده

This paper considers approximating a given nth-order stable transfer matrix G(s) by an rth-order stable transfer matrix Gr(s) in which n r, and where n is large. The Arnoldi process is used to generate a basis to a part of the controllability subspace associated with the realization of G(s), and a residual error is defined for any approximation in this subspace. We establish that minimizing the L1 norm of this residual error over the set of stable approximations leads to a 2-block distance problem. Finally, the solution of this distance problem is used to construct reduced-order approximate models. The behavior of the algorithms is illustrated with a simple example.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving large systems arising from fractional models by preconditioned methods

This study develops and analyzes preconditioned Krylov subspace methods to solve linear systems arising from discretization of the time-independent space-fractional models. First, we apply shifted Grunwald formulas to obtain a stable finite difference approximation to fractional advection-diffusion equations. Then, we employee two preconditioned iterative methods, namely, the preconditioned gen...

متن کامل

Preconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation

Introduction Fractional differential equations (FDEs)  have  attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme  may be a good approach, particularly, the schemes in numerical linear algebra for solving ...

متن کامل

On the global Krylov subspace methods for solving general coupled matrix equations

In the present paper, we propose the global full orthogonalization method (Gl-FOM) and global generalized minimum residual (Gl-GMRES) method for solving large and sparse general coupled matrix equations

متن کامل

Student Krylov Day 2015

Krylov subspace methods have been applied successfully to solve various problems in Numerical Linear Algebra. The Netherlands have been a pioneer country in the development of Krylov methods over the past years. Methods like the Conjugate Gradient Squared (CGS), Bi-Conjugate Gradient Stabilized (BiCGSTAB), Nested GMRES (GMRESR), and the Induced Dimension Reduction method (IDR) are examples of K...

متن کامل

Parallel Krylov Methods for Econometric Model Simulation

This paper investigates parallel solution methods to simulate large-scale macroeconometric models with forward-looking variables. The method chosen is the Newton-Krylov algorithm. We concentrate on a parallel solution to the sparse linear system arising in the Newton algorithm, and we empirically analyze the scalability of the GMRES method, which belongs to the class of so-called Krylov subspac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998